Applying a diffusive load balancing in a clustered P2P system
نویسنده
چکیده
Although a large number of users are using P2P systems, the ability of these systems to provide services with quality is questioned. A load balanced P2P system can provide services with smaller failure rate and better performance; hence, service quality of the system can be improved. Cluster systems have been adopted for services which are tolerant to faults. Although a cluster structure improving the reliability and robustness of a P2P system, the load unbalancing problem still remains because of the heterogeneities of nodes and requests. Existing dynamic load balancing mechanisms in P2P systems require extra connections and overhead on aggregating the load status from the nodes. We propose diffusive load balancing in a clustered P2P system, where a global balance is achieved through balancing the neighborhoods of all clusters within the existing overlay network. We simulated three load balancing schemes: directory-initiated, sender-initiated, and receiver-initiated; from an initially unbalanced situation, the results show that diffusive load balancing can achieve a global balance comparable to a centralized directory scheme, and the distributed directory-initiated scheme provides better results than the senderor receiver-initiated schemes.
منابع مشابه
Diffusive Load Balancing of Loosely-Synchronous Parallel Programs over Peer-to-Peer Networks
The use of under-utilized Internet resources is widely recognized as a viable form of high performance computing. Sustained processing power of roughly 40T FLOPS using 4 million volunteered Internet hosts has been reported for embarrassingly parallel problems. At the same time, peer-to-peer (P2P) file sharing networks, with more than 50 million participants, have demonstrated the capacity for s...
متن کاملA Load Balancing Algorithm Based on Replication and Movement of Data Items for Dynamic Structured P2p Systems
Load balancing is one of the main challenges of every structured peer-to-peer (P2P) system that uses distributed hash tables to map and distribute data items (objects) onto the nodes of the system. In a typical P2P system with N nodes, the use of random hash functions for distributing keys among peer nodes can lead to O(log N) imbalance. Most existing load balancing algorithms for structured P2...
متن کاملPeer-to-peer platforms for high-quality web services: the case for load-balanced clustered peer-to-peer systems
This chapter presents a clustered peer-to-peer system as a resource organization structure for webservice hosting platforms where service quality such as response time and service availability are provided with assurance. The peer-to-peer organization allows integration of autonomous resources into a single platform in a scalable manner. In clustered peer-to-peer systems, nodes are organized in...
متن کاملEffective load-balancing of peer-to-peer systems
The growing popularity of peer-to-peer (P2P) systems has necessitated the need for managing huge volumes of data efficiently to ensure acceptable user response times. Dynamically changing popularities of data items and skewed user query patterns in P2P systems may cause some of the peers to become bottlenecks, thereby resulting in severe load imbalance and consequently increased user response t...
متن کاملDistributed Dynamic Load Balancing in P2P Grid Systems
P2P Grids could solve large-scale scientific problems by using geographically distributed heterogeneous resources. However, a number of major technical obstacles must be overcome before this potential can be realized. One critical problem to improve the effective utilization of P2P Grids is the efficient load balancing. This chapter addresses the above-mentioned problem by using a distributed l...
متن کامل